Quantum algorithms for Schrieffer-Wolff transformation
نویسندگان
چکیده
The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems and give an effective Hamiltonian that describes the low-energy dynamics of exact in subspace unperturbed Hamiltonian. This unitary decoupling high-energy subspaces for transformed can be realized by quantum circuits. We a fully algorithm realizing SW transformation. also propose hybrid quantum-classical finding on NISQ hardware, where general cost function is used indicate degree. Numerical simulations without or with noise experiments computer ibmq_manila are implemented Heisenberg chain model. Our results verify show its validity near-term computers.
منابع مشابه
0 Rigorous Schrieffer - Wolff transformation for the Anderson impurity model Gilles Poirot
With the help of computer algebra, I devise an exact unitary transforma-tion for the Anderson impurity model which allows to kill the hybridizationterm in the slightly simplified case of zero chemical potential. Then I computeexplicitly the outcome of this transformation. This is a rigorous version of thewell known Schrieffer-Wolff transformation. It should be possible to tr...
متن کاملTheory of the Anderson Impurity Model: The Schrieffer–Wolff Transformation Reexamined
We test the method of infinitesimal unitary transformations recently introduced by Wegner on the Anderson single impurity model. It is demonstrated that infinitesimal unitary transformations in contrast to the Schrieffer Wolff transformation allow the construction of an effective Kondo Hamiltonian consistent with the established results in this well understood model. The main reason for this is...
متن کاملParallel Wolff Cluster Algorithms
The Wolff single-cluster algorithm is the most efficient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Wolff clusters, this method does not easily lend itself to efficient parallel implementation, so that simulations using this method have thus far been confined to workstations and vector machines. Here we present two parallel ...
متن کامل1 Algorithms for Quantum Systems — Quantum Algorithms
Since the presentation of polynomial time quantum algorithms for discrete log and factoring [Sho94] it is generally accepted that quantum computers may—at least for some problems— outperform classical ones. But the field of quantum information processing does not only have implications for computational problems. Using quantum mechanical systems for information processing naturally leads to the...
متن کاملMATLAB algorithms for TP transformation
Higher Order Singular Value Decomposition (HOSVD) based Tensor Product (TP) transformation technique has recently been proposed [1] in the field of Linear Matrix Inequality (LMI) based control theories [2]. The main objective of the TP transformation is that it is capable of transforming a dynamic model to the convex combination of linear systems, whereupon various LMI controller design techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review research
سال: 2022
ISSN: ['2643-1564']
DOI: https://doi.org/10.1103/physrevresearch.4.043023